On iteration methods without derivatives for the simultaneous determination of polynomial zeros
نویسندگان
چکیده
Carstensen, C. and M.S. PetkoviC, On iteration methods without derivatives for the simultaneous determination of polynomial zeros, Journal of Computational and Applied Mathematics 45 (1993) 251-266. Several algorithms for simultaneously approximating simple complex zeros of a polynomial are presented. These algorithms use Weierstrass’ corrections and do not require any polynomial derivatives. It is shown that Nourein’s method is, actually, regula falsi for Weierstrass’ corrections. Convergence analysis and computational efficiency are given for the considered methods in complex and circular arithmetic. Special attention is paid to hybrid methods that combine the efficiency of floating-point arithmetic and the inclusion property of interval arithmetic.
منابع مشابه
Semilocal Convergence of Two Iterative Methods for Simultaneous Computation of Polynomial Zeros
In this paper we study some iterative methods for simultaneous approximation of polynomial zeros. We give new semilocal convergence theorems with error bounds for Ehrlich’s and Nourein’s iterations. Our theorems generalize and improve recent results of Zheng and Huang [J. Comput. Math. 18 (2000), 113– 122], Petković and Herceg [J. Comput. Appl. Math. 136 (2001), 283–307] and Nedić [Novi Sad J. ...
متن کاملLaguerre-like Methods for the Simultaneous Approximation of Polynomial Multiple Zeros
Two new methods of the fourth order for the simultaneous determination of multiple zeros of a polynomial are proposed. The presented methods are based on the fixed point relation of Laguerre's type and realized in ordinary complex arithmetic as well as circular complex interval arithmetic. The derived iterative formulas are suitable for the construction of modified methods with improved converg...
متن کاملFilomat 17 (2003), 155–168 Derivative Free Combined Method for the Simultaneous Inclusion of Polynomial Zeros
Abstract. A combined method for the simultaneous inclusion of complex zeros of a polynomial, composed of two circular arithmetic methods, is presented. This method does not use polynomial derivatives and has the order of convergence equals four. Computationally verifiable initial conditions that guarantee the convergence are also stated. Two numerical example are included to demonstrate the con...
متن کاملOn the $s^{th}$ derivative of a polynomial
For every $1leq s< n$, the $s^{th}$ derivative of a polynomial $P(z)$ of degree $n$ is a polynomial $P^{(s)}(z)$ whose degree is $(n-s)$. This paper presents a result which gives generalizations of some inequalities regarding the $s^{th}$ derivative of a polynomial having zeros outside a circle. Besides, our result gives interesting refinements of some well-known results.
متن کاملHigher Order Methods for the Inclusion of Multiple Zeros of Polynomials
Starting from a suitable fixed point relation, we derive higher order iterative methods for the simultaneous inclusion of polynomial multiple zeros in circular complex interval arithmetic. Each of the resulting disks contain one and only one zero in every iteration. This convenient inclusion property, together with very fast convergence, ranks these methods among the most powerful iterative met...
متن کامل